Closure operators on sets and algebraic lattices
نویسنده
چکیده
Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such as group, ring, field, lattice, vector space, etc., taking the substructure generated by a set, i.e., the least substructure which includes that set, is a closure operator. Given a binary relation, taking the relation with certain properties, such as reflexive, transitive, equivalence, etc., generated by the given relation, i.e., the least relation with the desired properties which includes the original relation, is a closure operator. The consequence operators in mathematical logic are closure operators. Topological spaces can be defined by Kuratowski closure operators. In this survey paper we have selected those facts about closure operators that we consider to be the most important ones. We present them in the “Ockham razor” spirit, i.e., under no more hypotheses than necessary. We have thus detected three levels of generality: A) closure operators on posets, B) closure operators on complete lattices, and C) closure operators on fields of sets P(A), which we tackle in this order. Level A, due to Bourbaki, is less known. However the fundamental property used in the applications of closure operators to various fields of mathematics is valid for arbitrary posets: the existence of the closure x̄ of each element x of the underlying set, that is, the least closed element which includes x. Besides, closure operators are in bijection with the associated sets of closed elements, known as closure systems or Moore families. In the case of complete lattices, every (finite or not) meet of closed elements is closed, so that every Moore family is itself a complete lattice, but not a sublattice of the original one. Level C is the framework of algebraic closures, whose associated closure systems describe an algebraic structure, or equivalently, a deductive structure. We have incorporated this equivalence and two intrinsic characterizations of algebraic closures, in a theorem which is emblematic for the unifying power of closure operators. The last part of the paper is devoted to compactly generated complete lattices, known as algebraic lattices. They are related to level C by a representation theorem. For properties of closure operators not included in this paper see e.g. [2, §§ 4.4, 4.5].
منابع مشابه
n-closure systems and n-closure operators
It is very well known and permeating the whole of mathematics that a closure operator on a given set gives rise to a closure system, whose constituent sets form a complete lattice under inclusion, and vice-versa. Recent work of Wille on triadic concept analysis and subsequent work by the author on polyadic concept analysis led to the introduction of complete trilattices and complete n-lattices,...
متن کاملLinear v{C}ech closure spaces
In this paper, we introduce the concept of linear v{C}ech closure spaces and establish the properties of open sets in linear v{C}ech closure spaces (Lv{C}CS). Here, we observe that the concept of linearity is preserved by semi-open sets, g-semi open sets, $gamma$-open sets, sgc-dense sets and compact sets in Lv{C}CS. We also discuss the concept of relative v{C}ech closure operator, meet and pro...
متن کاملAlgebraic Properties of Intuitionistic Fuzzy Residuated Lattices
In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...
متن کاملFrom torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملClosure Operators and Choice Operators: a Survey (Abstract)
In this talk I will give a overview on the connections between closure operators and choice operators and on related results. An operator on a finite set S is a map defined on the set P(S) of all the subsets of S. A closure operator is an extensive, isotone and idempotent operator. A choice operator c is a contracting operator (c(A) ⊆ A, for every A ⊆ S). Choice operators and their lattices hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013